ALGORITMA SHARED NEAREST NEIGHBOR BERBASIS DATA SHRINKING
نویسندگان
چکیده
منابع مشابه
Liquid-liquid equilibrium data prediction using large margin nearest neighbor
Guanidine hydrochloride has been widely used in the initial recovery steps of active protein from the inclusion bodies in aqueous two-phase system (ATPS). The knowledge of the guanidine hydrochloride effects on the liquid-liquid equilibrium (LLE) phase diagram behavior is still inadequate and no comprehensive theory exists for the prediction of the experimental trends. Therefore the effect the ...
متن کاملAn Improved k-Nearest Neighbor Classification Algorithm Using Shared Nearest Neighbor Similarity
k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN classifier may decrease the precision of classification because of the uneven density of t raining samples .In view of the defect, an improved k-nearest neighbor algorithm is presented using shared nearest neighbor similarity which can compute similarity between test ...
متن کاملA New Shared Nearest Neighbor Clustering Algorithm and its Applications
Clustering depends critically on density and distance (similarity), but these concepts become increasingly more difficult to define as dimensionality increases. In this paper we offer definitions of density and similarity that work well for high dimensional data (actually, for data of any dimensionality). In particular, we use a similarity measure that is based on the number of neighbors that t...
متن کاملClustering with Shared Nearest Neighbor-unscented Transform Based Estimation
Subspace clustering developed from the group of cluster objects in all subspaces of a dataset. When clustering high dimensional objects, the accuracy and efficiency of traditional clustering algorithms are very poor, because data objects may belong to diverse clusters in different subspaces comprised of different combinations of dimensions. To overcome the above issue, we are going to implement...
متن کاملk-Nearest Neighbor Classification on Spatial Data
Classification of spatial data streams is crucial, since the training dataset changes often. Building a new classifier each time can be very costly with most techniques. In this situation, k-nearest neighbor (KNN) classification is a very good choice, since no residual classifier needs to be built ahead of time. KNN is extremely simple to implement and lends itself to a wide variety of variatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JUTI: Jurnal Ilmiah Teknologi Informasi
سال: 2008
ISSN: 2406-8535,1412-6389
DOI: 10.12962/j24068535.v7i1.a56